<!-- This comment will put IE 6, 7 and 8 in quirks mode -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>examples/EA/SOO/TSP.cpp Source File</title>
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3.0.1/es5/tex-mml-chtml.js"></script>
<script src="../../mlstyle.js"></script>
<link href="../css/besser.css" rel="stylesheet" type="text/css"/>
</head>
<!-- pretty cool: each body gets an id tag which is the basename of the web page  -->
<!--              and allows for page-specific CSS. this is client-side scripted, -->
<!--              so the id will not yet show up in the served source code -->
<script type="text/javascript">
    jQuery(document).ready(function () {
        var url = jQuery(location).attr('href');
        var pname = url.substr(url.lastIndexOf("/")+1, url.lastIndexOf(".")-url.lastIndexOf("/")-1);
        jQuery('#this_url').html('<strong>' + pname + '</strong>');
        jQuery('body').attr('id', pname);
    });
</script>
<body>
    <div id="shark_old">
        <div id="wrap">
            <div id="header">
                <div id="site-name"><a href="../../sphinx_pages/build/html/index.html">Shark machine learning library</a></div>
                <ul id="nav">
                    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/installation.html">Installation</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/tutorials/tutorials.html">Tutorials</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/benchmark.html">Benchmarks</a>
                    </li>
                    <li class="active">
                        <a href="classes.html">Documentation</a>
                        <ul>
                            <li class="first"></li>
                            <li><a href="../../sphinx_pages/build/html/rest_sources/quickref/quickref.html">Quick references</a></li>
                            <li><a href="classes.html">Class list</a></li>
                            <li class="last"><a href="group__shark__globals.html">Global functions</a></li>
                        </ul>
                    </li>
                </ul>
            </div>
        </div>
    </div>
<div id="doxywrapper">
<!--
    <div id="global_doxytitle">Doxygen<br>Documentation:</div>
-->
    <div id="navrow_wrapper">
<!-- Generated by Doxygen 1.9.8 -->
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_d28a4824dc47e487b107a5db32ef43c4.html">examples</a></li><li class="navelem"><a class="el" href="dir_2a183e805d3de2a690c8e5378d3184ca.html">EA</a></li><li class="navelem"><a class="el" href="dir_08d02812a3e386f0d5522171f8c9a0aa.html">SOO</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle"><div class="title">TSP.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="_t_s_p_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*!</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * </span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> *</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * \brief       A 10-city traveling salesman problem.</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"></span> </div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * The implementation follows:</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * &lt;p&gt;</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * D. E. Goldberg and R. Lingle, Alleles, loci, and traveling</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * salesman problem. In &lt;em&gt; Proc. of the International Conference on</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * Genetic Algorithms and Their Applications&lt;/em&gt;, pages 154-159,</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * Pittsburg, PA, 1985 &lt;/p&gt; </span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"></span> </div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * The traveling salsman problem is a combinatorial optimization task. A</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * salesman is supposed to visit $n$ cities. Each travelling connection</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * is associated with a cost (i.e. the time fot the trip). The problem is</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * to find the cheapest round-route that visits each city exactly once</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * and returns to the starting point.</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"></span> </div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * </span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> *</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * \author      T. Voss</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * \date        -</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> *</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> *</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * \par Copyright 1995-2017 Shark Development Team</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * </span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * &lt;BR&gt;&lt;HR&gt;</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * This file is part of Shark.</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * &lt;https://shark-ml.github.io/Shark/&gt;</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * </span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> * Shark is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> * it under the terms of the GNU Lesser General Public License as published </span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment"> * by the Free Software Foundation, either version 3 of the License, or</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment"> * </span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment"> * Shark is distributed in the hope that it will be useful,</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment"> * GNU Lesser General Public License for more details.</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment"> * </span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment"> * You should have received a copy of the GNU Lesser General Public License</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment"> * along with Shark.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment"> *</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment"> */</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;<a class="code" href="_partially_mapped_crossover_8h.html">shark/Algorithms/DirectSearch/Operators/Recombination/PartiallyMappedCrossover.h</a>&gt;</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;<a class="code" href="_roulette_wheel_selection_8h.html">shark/Algorithms/DirectSearch/Operators/Selection/RouletteWheelSelection.h</a>&gt;</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="preprocessor">#include &lt;<a class="code" href="_individual_8h.html">shark/Algorithms/DirectSearch/Individual.h</a>&gt;</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;<a class="code" href="_abstract_objective_function_8h.html" title="AbstractObjectiveFunction.">shark/ObjectiveFunctions/AbstractObjectiveFunction.h</a>&gt;</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;<a class="code" href="_base_8h.html">shark/LinAlg/Base.h</a>&gt;</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#include &lt;boost/format.hpp&gt;</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="preprocessor">#if BOOST_VERSION == 106000</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#include &lt;boost/type_traits/ice.hpp&gt;</span><span class="comment">//Required because of boost 1.60 bug</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="preprocessor">#include &lt;boost/graph/adjacency_matrix.hpp&gt;</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="preprocessor">#include &lt;boost/graph/adjacency_list.hpp&gt;</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="preprocessor">#include &lt;boost/graph/graphml.hpp&gt;</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="preprocessor">#include &lt;boost/graph/graphviz.hpp&gt;</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="preprocessor">#include &lt;boost/graph/metric_tsp_approx.hpp&gt;</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="preprocessor">#include &lt;boost/property_map/dynamic_property_map.hpp&gt;</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="preprocessor">#include &lt;numeric&gt;</span><span class="comment">//for iota</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="keyword">using namespace </span><a class="code hl_namespace" href="namespaceshark.html" title="AbstractMultiObjectiveOptimizer.">shark</a>;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#a2394fedbbb33f45e33ab367231294820">   65</a></span><span class="keyword">typedef</span> IntVector <a class="code hl_typedef" href="_t_s_p_8cpp.html#a2394fedbbb33f45e33ab367231294820">Tour</a>;</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment"></span> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">/**</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment"> * \brief Defines the problem, i.e., its cost matrix.</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment"> */</span></div>
<div class="foldopen" id="foldopen00070" data-start="{" data-end="};">
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#a51d1bfcd285f9ef842e7308cf36a686e">   70</a></span><span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="_t_s_p_8cpp.html#a51d1bfcd285f9ef842e7308cf36a686e" title="Defines the problem, i.e., its cost matrix.">cities</a>[10][10] = {</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    {       0,      28,     57,     72,     81,     85,     80,     113,    89,     80 },</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    {       28,     0,      28,     45,     54,     57,     63,     85,     63,     63 },</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    {       57,     28,     0,      20,     30,     28,     57,     57,     40,     57 },</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    {       72,     45,     20,     0,      10,     20,     72,     45,     20,     45 },</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    {       81,     54,     30,     10,     0,      22,     81,     41,     10,     41 },</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    {       85,     57,     28,     20,     22,     0,      63,     28,     28,     63 },</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    {       80,     63,     57,     72,     81,     63,     0,      80,     89,     113 },</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    {       113,    85,     57,     45,     41,     28,     80,     0,      40,     80 },</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    {       89,     63,     40,     20,     10,     28,     89,     40,     0,      40 },</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    {       80,     63,     57,     45,     41,     63,     113,    80,     40,     0 }</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>};</div>
</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keyword">typedef</span> boost::adjacency_matrix&lt; boost::undirectedS,</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    boost::property&lt; boost::vertex_color_t, std::string &gt;,</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    boost::property&lt; boost::edge_weight_t, double,</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        boost::property&lt; boost::edge_color_t, std::string &gt;</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    &gt;,</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    boost::no_property </div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#adfae45172a6434db44eaa0a82230d4fe">   89</a></span>&gt; <a class="code hl_typedef" href="_t_s_p_8cpp.html#adfae45172a6434db44eaa0a82230d4fe">Graph</a>;</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#a8c93f604acf57e6a9bae1f91c379ac98">   90</a></span><span class="keyword">typedef</span> boost::graph_traits&lt;Graph&gt;::vertex_descriptor <a class="code hl_typedef" href="_t_s_p_8cpp.html#a8c93f604acf57e6a9bae1f91c379ac98">Vertex</a>;</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#a937736e62dd4d4c5fe8bc7b9de4c8833">   91</a></span><span class="keyword">typedef</span> boost::graph_traits&lt;Graph&gt;::edge_descriptor <a class="code hl_typedef" href="_t_s_p_8cpp.html#a937736e62dd4d4c5fe8bc7b9de4c8833">Edge</a>;</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#a7127d80548c23ba3b529a9c52cf30b63">   92</a></span><span class="keyword">typedef</span> boost::property_map&lt;Graph, boost::edge_weight_t&gt;::type <a class="code hl_typedef" href="_t_s_p_8cpp.html#a7127d80548c23ba3b529a9c52cf30b63">WeightMap</a>;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#a8d3adf2591c75e0cc841e7f8f4e53cb3">   93</a></span><span class="keyword">typedef</span> boost::property_map&lt;Graph, boost::edge_color_t&gt;::type <a class="code hl_typedef" href="_t_s_p_8cpp.html#a8d3adf2591c75e0cc841e7f8f4e53cb3">ColorMap</a>;</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#aa2af735cda68526094633853c8a9894d">   95</a></span><span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_individual.html" title="Individual is a simple templated class modelling an individual that acts as a candidate solution in a...">Individual&lt; Tour,double &gt;</a> <a class="code hl_typedef" href="_t_s_p_8cpp.html#aa2af735cda68526094633853c8a9894d">IndividualType</a>;</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#a64dfcdc1a48639f7e4e3cb79e17f0018">   96</a></span><span class="keyword">typedef</span> std::vector&lt; IndividualType &gt; <a class="code hl_typedef" href="_t_s_p_8cpp.html#a64dfcdc1a48639f7e4e3cb79e17f0018">Population</a>;</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment"></span> </div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment">/// \brief Calculates the cost of a tour w.r.t. to a cost matrix.</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment"></span><span class="keyword">struct </span>TspTourLength : <span class="keyword">public</span> <a class="code hl_class" href="classshark_1_1_abstract_objective_function.html">SingleObjectiveFunction</a>{</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="comment"></span> </div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment">    /// \brief Default c&#39;tor, initializes the cost matrix.</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="comment"></span>    TspTourLength( RealMatrix <span class="keyword">const</span>&amp; costMatrix) : m_costMatrix( costMatrix )</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    { }</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::string <a class="code hl_function" href="classshark_1_1_i_nameable.html#a9893f99314de30cd472e649c235d0db4" title="returns the name of the object">name</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <span class="stringliteral">&quot;TspTourLength&quot;</span>; }</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::size_t <a class="code hl_function" href="classshark_1_1_abstract_objective_function.html#a256f6b128af038dfaf9cef1bcd45a426" title="Accesses the number of variables.">numberOfVariables</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> m_costMatrix.size1(); }</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment"></span> </div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">    /**</span></div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="comment">     * \brief Calculates the costs of the supplied tour.</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="comment">     */</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_typedef" href="classshark_1_1_abstract_objective_function.html#a70f0672a3c3b24c437c81243624b5307">ResultType</a> <a class="code hl_function" href="classshark_1_1_abstract_objective_function.html#a751c175270f6d6f0bcc1200f333c0045" title="Evaluates the objective function for the supplied argument.">eval</a>( <span class="keyword">const</span> <a class="code hl_typedef" href="classshark_1_1_abstract_objective_function.html#a59bfea031628e16737c66e7117eba7b5">SearchPointType</a> &amp; input )<span class="keyword"> const </span>{                    </div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <a class="code hl_define" href="_exception_8h.html#a42a6a50e4d06c00d60fbca5333f40768">SIZE_CHECK</a>( input.size() == m_costMatrix.size1() );</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <a class="code hl_variable" href="classshark_1_1_abstract_objective_function.html#af0942c072be06d0dd4da5ee7067c5777" title="Evaluation counter, default value: 0.">m_evaluationCounter</a>++;</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <a class="code hl_typedef" href="classshark_1_1_abstract_objective_function.html#a70f0672a3c3b24c437c81243624b5307">ResultType</a> result(0);</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        <span class="keywordflow">for</span>( std::size_t i = 0; i &lt; input.size() - 1; i++ ) {</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            result += m_costMatrix( input( i ), input( i+1 ) );</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        }</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    }</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    RealMatrix m_costMatrix;</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>};</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
<div class="foldopen" id="foldopen00128" data-start="{" data-end="}">
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="_t_s_p_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  128</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="_datasets_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>( <span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> ** argv ) {</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">// Define the problem instance</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <a class="code hl_typedef" href="_t_s_p_8cpp.html#adfae45172a6434db44eaa0a82230d4fe">Graph</a> g( 10 );</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="comment">// Iterate the graph and assign a label to every vertex</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    boost::graph_traits&lt;Graph&gt;::vertex_iterator v, v_end;</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordflow">for</span>( boost::tie(v,v_end) = boost::vertices(g); v != v_end; ++v )</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    boost::put(boost::vertex_color_t(), g, *v, ( boost::format( <span class="stringliteral">&quot;City_%1%&quot;</span> ) % *v ).str() );</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="comment">// Get hold of the weight map and the color map for calculation and visualization purposes.</span></div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_typedef" href="_t_s_p_8cpp.html#a7127d80548c23ba3b529a9c52cf30b63">WeightMap</a> weightMap = boost::get( boost::edge_weight, g );</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <a class="code hl_typedef" href="_t_s_p_8cpp.html#a8d3adf2591c75e0cc841e7f8f4e53cb3">ColorMap</a> colorMap = boost::get( boost::edge_color, g );</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    </div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="comment">// Iterate the graph and insert distances.</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <a class="code hl_typedef" href="_t_s_p_8cpp.html#a937736e62dd4d4c5fe8bc7b9de4c8833">Edge</a> e;</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="keywordtype">bool</span> inserted = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    </div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    RealMatrix costMatrix( 10, 10 );</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordflow">for</span>( std::size_t i = 0; i &lt; costMatrix.size1(); i++ ) {</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordflow">for</span>( std::size_t j = 0; j &lt; costMatrix.size1(); j++ ) {</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            <span class="keywordflow">if</span>( i == j ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            costMatrix(i,j) = <a class="code hl_variable" href="_t_s_p_8cpp.html#a51d1bfcd285f9ef842e7308cf36a686e" title="Defines the problem, i.e., its cost matrix.">cities</a>[i][j];</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            <span class="comment">// Add the edge</span></div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>            boost::tie( e, inserted ) = boost::add_edge( i, j, g );</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>            <span class="keywordflow">if</span>( inserted ) {</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                <span class="comment">// Remember distance between cities i and j.</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                weightMap[ e ] = <a class="code hl_variable" href="_t_s_p_8cpp.html#a51d1bfcd285f9ef842e7308cf36a686e" title="Defines the problem, i.e., its cost matrix.">cities</a>[i][j];</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                <span class="comment">// Mark the edge as blue.</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                colorMap[ e ] = <span class="stringliteral">&quot;blue&quot;</span>;</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>            }</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        }</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    }</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <span class="comment">// Mating selection operator</span></div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <a class="code hl_struct" href="structshark_1_1_roulette_wheel_selection.html" title="Fitness-proportional selection operator.">RouletteWheelSelection</a> rws;</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="comment">// Variation (crossover) operator</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <a class="code hl_struct" href="structshark_1_1_partially_mapped_crossover.html" title="Implements partially mapped crossover.">PartiallyMappedCrossover</a> pmx;    </div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="comment">// Fitness function instance.</span></div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    TspTourLength ttl( costMatrix );</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    ttl.init();</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="comment">// Size of the parent population</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keyword">const</span> std::size_t mu = 100;</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="comment">// Size of the offspring population</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="keyword">const</span> std::size_t lambda = 100;</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="comment">// Parent population</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <a class="code hl_typedef" href="_t_s_p_8cpp.html#a64dfcdc1a48639f7e4e3cb79e17f0018">Population</a> parents( mu );</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="comment">// Offspring population</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <a class="code hl_typedef" href="_t_s_p_8cpp.html#a64dfcdc1a48639f7e4e3cb79e17f0018">Population</a> offspring( lambda );</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    <span class="comment">// Default tour: 0,...,9</span></div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <a class="code hl_typedef" href="_t_s_p_8cpp.html#a2394fedbbb33f45e33ab367231294820">Tour</a> t( 10 );</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    std::iota( t.begin(),t.end(), 0 );</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="comment">// Initialize parents</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="keywordflow">for</span>( std::size_t i = 0; i &lt; parents.size(); i++ ) {</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        parents[i].searchPoint() = t;</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        <span class="comment">// Generate a permutation.</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        std::random_shuffle( parents[ i ].<a class="code hl_function" href="namespaceshark.html#a68954303294e98c77d03dad52e32bd9e">searchPoint</a>().begin(), parents[ i ].<a class="code hl_function" href="namespaceshark.html#a68954303294e98c77d03dad52e32bd9e">searchPoint</a>().end() );</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <span class="comment">// Evaluate the individual.</span></div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        parents[i].penalizedFitness() = parents[i].unpenalizedFitness() = ttl( parents[i].<a class="code hl_function" href="namespaceshark.html#a68954303294e98c77d03dad52e32bd9e">searchPoint</a>() );</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    }</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="comment">// Loop until maximum number of fitness function evaluations is reached.</span></div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">while</span>( ttl.evaluationCounter() &lt; 10000 ) {</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        RealVector selectionProbabilities(parents.size());</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <span class="keywordflow">for</span>(std::size_t i = 0; i != parents.size(); ++i){</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            selectionProbabilities(i) = parents[i].unpenalizedFitness();</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        }</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        selectionProbabilities/= sum(selectionProbabilities);</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        <span class="comment">// Crossover candidates.</span></div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">for</span>( std::size_t i = 0; i &lt; offspring.size() - 1; i+=2 ) {</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            <span class="comment">// Carry out fitness proportional fitness selection and</span></div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            <span class="comment">// perform partially mapped crossover on parent individuals.</span></div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>            offspring[ i ] = *rws( <a class="code hl_variable" href="namespaceshark_1_1random.html#ab5c1547eee483974d008d43f621a2234">random::globalRng</a>, parents.begin(), parents.end(), selectionProbabilities );</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>            offspring[ i+1 ] = *rws( <a class="code hl_variable" href="namespaceshark_1_1random.html#ab5c1547eee483974d008d43f621a2234">random::globalRng</a>, parents.begin(), parents.end(), selectionProbabilities );</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>            pmx(<a class="code hl_variable" href="namespaceshark_1_1random.html#ab5c1547eee483974d008d43f621a2234">random::globalRng</a>, offspring[ i ], offspring[ i+1 ]);</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span> </div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>            <span class="comment">// Evaluate offspring individuals.</span></div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>            offspring[ i ].penalizedFitness() = </div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>            offspring[ i ].unpenalizedFitness() = ttl( offspring[ i ].<a class="code hl_function" href="namespaceshark.html#a68954303294e98c77d03dad52e32bd9e">searchPoint</a>() );      </div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>            offspring[ i+1 ].penalizedFitness() = </div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>            offspring[ i+1 ].unpenalizedFitness() = ttl( offspring[ i+1 ].<a class="code hl_function" href="namespaceshark.html#a68954303294e98c77d03dad52e32bd9e">searchPoint</a>()  );</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>        }</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>        <span class="comment">// Swap parent and offspring population.</span></div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        std::swap( parents, offspring );</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    }</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span> </div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <span class="comment">// Sort in ascending order to find best individual.</span></div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    std::sort( parents.begin(), parents.end(), <a class="code hl_struct" href="structshark_1_1_individual_1_1_fitness_ordering.html" title="Ordering relation by the fitness of the individuals(only single objective)">IndividualType::FitnessOrdering</a>());</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    </div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="comment">// Extract the best tour currently known.</span></div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <a class="code hl_typedef" href="_t_s_p_8cpp.html#a2394fedbbb33f45e33ab367231294820">Tour</a> <span class="keyword">final</span> = parents.front().searchPoint();</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> </div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <span class="comment">// Mark the final tour green in the graph.</span></div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    <span class="keywordtype">bool</span> extracted = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <span class="keywordflow">for</span>( std::size_t i = 0; i &lt; <span class="keyword">final</span>.size() - 1; i++ ) {</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        boost::tie( e, extracted ) = boost::edge( <a class="code hl_typedef" href="_t_s_p_8cpp.html#a8c93f604acf57e6a9bae1f91c379ac98">Vertex</a>( <span class="keyword">final</span>( i ) ), <a class="code hl_typedef" href="_t_s_p_8cpp.html#a8c93f604acf57e6a9bae1f91c379ac98">Vertex</a>( <span class="keyword">final</span>( i + 1 ) ), g );</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    </div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="keywordflow">if</span>( extracted )</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        colorMap[ e ] = <span class="stringliteral">&quot;green&quot;</span>;</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    }</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <span class="comment">// Calculate approximate solution</span></div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="keywordtype">double</span> len = 0.0;</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    std::vector&lt; Vertex &gt; approxTour;</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    boost::metric_tsp_approx( g, boost::make_tsp_tour_len_visitor( g, std::back_inserter( approxTour ) , len, weightMap ) );</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="comment">// Mark the approximation red in the graph.</span></div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <span class="keywordflow">for</span>( std::size_t i = 0; i &lt; approxTour.size() - 1; i++ ) {</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    boost::tie( e, extracted ) = boost::edge( approxTour[ i ], approxTour[ i+1 ], g );</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    </div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="keywordflow">if</span>( extracted )</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>        colorMap[ e ] = <span class="stringliteral">&quot;red&quot;</span>;</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    }</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span> </div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    <span class="comment">// Output the graph and the final path</span></div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    std::ofstream outGraphviz( <span class="stringliteral">&quot;graph.dot&quot;</span> );</div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    boost::dynamic_properties dp;</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    dp.property( <span class="stringliteral">&quot;node_id&quot;</span>, boost::get( boost::vertex_color, g ) );</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    dp.property( <span class="stringliteral">&quot;weight&quot;</span>, boost::get( boost::edge_weight, g ) );</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    dp.property( <span class="stringliteral">&quot;label&quot;</span>, boost::get( boost::edge_weight, g ) );</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    dp.property( <span class="stringliteral">&quot;color&quot;</span>, boost::get( boost::edge_color, g ) );</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    boost::write_graphviz_dp( outGraphviz, g, dp );</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="comment">// Output best solution and corresponding fitness.</span></div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    std::cout &lt;&lt; parents.front().searchPoint() &lt;&lt; <span class="stringliteral">&quot; -&gt; &quot;</span> &lt;&lt; parents.front().unpenalizedFitness() &lt;&lt; std::endl;</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    <span class="comment">// Output approximate solution and corresponding fitness.</span></div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Approx: &quot;</span> &lt;&lt; len &lt;&lt; <span class="stringliteral">&quot; vs. GA: &quot;</span> &lt;&lt; parents.front().unpenalizedFitness() &lt;&lt; std::endl;</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <span class="keywordflow">return</span> EXIT_SUCCESS;</div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>}</div>
</div>
</div><!-- fragment --></div><!-- contents -->
</div>
</body>
</html>
